On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
نویسنده
چکیده
We consider the general problem of determining the maximum possible multiplicity of an eigenvalue in a Hermitian matrix whose graph contains exactly one cycle. For some cases we express that maximum multiplicity in terms of certain parameters associated with the graph. © 2006 Elsevier Inc. All rights reserved. AMS classification: 15A18; 05C38; 05C50
منابع مشابه
The Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملThe least eigenvalue of graphs whose complements are unicyclic
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n 2 ). In this paper we discuss the ...
متن کاملRational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns
Abstract. A sign pattern is a matrix whose entries are elements of {+,−, 0}; it describes the set of real matrices whose entries have the signs in the pattern. A graph (that allows loops but not multiple edges) describes the set of symmetric matrices having a zero-nonzero pattern of entries determined by the absence or presence of edges in the graph. DeAlba et al. [3] gave algorithms for the co...
متن کاملThe Graphs for which the Maximum Multiplicity of an Eigenvalue is Two
Characterized are all simple undirected graphs G such that any real symmetric matrix that has graph G has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general fields), but only certain partial 2-trees guarantee maximum multiplicity 2. Among partial linear 2-trees, they are only those whose vertices can be covered by t...
متن کاملکاهش ابعاد ماتریس انتقال در مدلهای دو بعدی آیزینگ و پاتس
A new algebraic method is developed to reduce the size of the transfer matrix of Ising and three-state Potts ferromagnets on strips of width r sites of square and triangular lattices. This size reduction has been set up in such a way that the maximum eigenvalues of both the reduced and the original transfer matrices became exactly the same. In this method we write the original transfer matrix ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007